An Algorithm for Crew Route Scheduling Focusing on Manpower Efficiency
نویسندگان
چکیده
منابع مشابه
An Improved Column Generation Algorithm for Crew Scheduling Problems ⋆
Column Generation (CG) technique is popularly applied in solving the crew scheduling problem of large size, which is generally modeled as an Integer Linear Programming (ILP) problem. The traditional CG algorithms for bus and rail crew scheduling encounter difficulties on either the generation of all potential shifts or solving subproblems. A subproblem embedded in the CG is generally represente...
متن کاملA tree search algorithm for the crew scheduling problem
In this paper we consider the crew scheduling program, that is the problem of assigning K crews to N tasks with fixed start and finish times such that each crew does not exceed a limit on the total time it can spend working. A zero-one integer linear programming formulation of the problem is given, which is then relaxed in a lagrangean way to provide a lower bound which is improved by subgradie...
متن کاملTwo Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quarterly Report of RTRI
سال: 2013
ISSN: 0033-9008,1880-1765
DOI: 10.2219/rtriqr.54.197